hybrid harmony search for conditional p-median problems

نویسندگان

a. kaveh iust

h. nasr esfahani iust

چکیده

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Harmony Search Algorithm for Solving Dynamic Optimisation Problems

Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to seek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one o...

متن کامل

An Efficient Hybrid Metaheuristic for Capacitated p-Median Problem

Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...

متن کامل

A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems

Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...

متن کامل

Island-based harmony search for optimization problems

Harmony search (HS) algorithm is a recent meta-heuristic algorithm that mimics the musical improvisation concepts. This algorithm has been widely used for solving optimization problems. Moreover, many modifications in this algorithm have been carried out in order to improve the performance of the search. Island model is a structured population mechanism used in evolutionary algorithms to preser...

متن کامل

The p-median and p-center Problems on Bipartite Graphs

Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...

متن کامل

Hybrid Teaching-Learning-Based Optimization and Harmony Search for Optimum Design of Space Trusses

The Teaching-Learning-Based Optimization (TLBO) algorithm is a new meta-heuristic algorithm which recently received more attention in various fields of science. The TLBO algorithm divided into two phases: Teacher phase and student phase; In the first phase a teacher tries to teach the student to improve the class level, then in the second phase, students increase their level by interacting amon...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of civil engineering

جلد ۱۰، شماره ۱، صفحات ۳۲-۳۶

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023